Hardware Implementation of Discrete Fourier Transform and its Inverse Using Floating Point Numbers

نویسنده

  • Pramod Tanwar
چکیده

21  AbstractThis paper concentrates on the FPGA implementation of discrete Fourier transforms (DFT) and inverse discrete Fourier transform (IDFT) based on floating point numbers. Floating point representation of the numbers support much wider range of values and achieve greater range at the expense of precision. Firstly general purpose arithmetic modules addition, subtraction, multiplier and divider based on 32 bit single precision IEEE-754 standard are designed and then DFT/IDFT algorithms architectures are implemented. The architectures of DFT and IDFT algorithms are based on radix 2 butterfly computations due to its less computation time .To reduce the required hardware resources, resource sharing scheme is used. Algorithms architectures are designed using hardware description language (VHDL), simulated using ModelSim6.6e tool and then hardware is implemented on Xilinx Virtex-5 LX110T board.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fixed-point FPGA Implementation of a Kalman Filter for Range and Velocity Estimation of Moving Targets

Tracking filters are extensively used within object tracking systems in order to provide consecutive smooth estimations of position and velocity of the object with minimum error. Namely, Kalman filter and its numerous variants are widely known as simple yet effective linear tracking filters in many diverse applications. In this paper, an effective method is proposed for designing and implementa...

متن کامل

Fused Floating Point Arithmetic Unit for Radix 2 FFT Implementation

This paper describes the design and implementation of user defined fused floating-point arithmetic operations that can be used to implement Radix 2 butterfly Fast Fourier Transform (FFT) for complex numbers used in Digital Signal Processing (DSPC) processors. This paper reports the comparison of area, delay and power of fused floating point modules as compared to discrete floating point with re...

متن کامل

Lightweight Floating-Point Arithmetic: Case Study of Inverse Discrete Cosine Transform

To enable floating-point (FP) signal processing applications in low-power mobile devices, we propose lightweight floating-point arithmetic. It offers a wider range of precision/power/speed/area trade-offs, but is wrapped in forms that hide the complexity of the underlying implementations from bothmultimedia software designers and hardware designers. Libraries implemented in C++ and Verilog prov...

متن کامل

MRI Reconstruction Using Discrete Fourier Transform: A tutorial

The use of Inverse Discrete Fourier Transform (IDFT) implemented in the form of Inverse Fourier Transform (IFFT) is one of the standard method of reconstructing Magnetic Resonance Imaging (MRI) from uniformly sampled K-space data. In this tutorial, three of the major problems associated with the use of IFFT in MRI reconstruction are highlighted. The tutorial also gives brief introduction to MRI...

متن کامل

An Optimum Design of FFT Multi-Digit Multiplier and Its VLSI Implementation

We designed a VLSI chip of FFT multiplier based on simple Cooly Tukey FFT using a floating-point representation with optimal data length based on an experimental error analysis. The VLSI implementation using HITACHI CMOS 0.18μm technology can perform multiplication of 2 to 2 digit hexadecimal numbers 19.7 to 34.3 times (25.7 times in average) faster than software FFT multiplier at an area cost ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012